Embedding graphs as isometric medians
نویسندگان
چکیده
We show that every connected graph can be isometrically (i.e., as a distance preserving subgraph) embedded in some connected graph as its median. As an auxiliary result we also show that every connected graph is an isometric subgraph of some Cayley graph.
منابع مشابه
On the Natural Imprint Function of a Graph
In this paper, some characterizations of median and quasi-median graphs are extended to general isometric subgraphs of Cartesian products using the concept of an imprint function as introduced by Tardif. This extends the well-known concepts of medians in median graphs as well as imprints in quasi-median graphs. We introduce absolute C-median graphs in analogy to absolute retracts, and derive a ...
متن کاملA simple O(mn) algorithm for recognizing Hamming graphs
We show that any isometric irredundant embedding of a graph into a product of complete graphs is the canonical isometric embedding. This result is used to design a simple O(mn) algorithm for recognizing Hamming graphs.
متن کاملRecognition of the ` 1 - graphs withComplexity O ( nm ) , or Football in aHypercubeM
We ll in the details of the algorithm sketched in Sh] and determine its complexity. As a part of this main algorithm, we also describe an algorithm which recognizes graphs which are isometric subgraphs of halved cubes. We discuss possible further applications of the same ideas and give a nice example of a non`1-graph allowing a highly isometric embedding into a halved cube.
متن کاملThe strong isometric dimension of finite reflexive graphs
The strong isometric dimension of a reflexive graph is related to its injective hull: both deal with embedding reflexive graphs in the strong product of paths. We give several upper and lower bounds for the strong isometric dimension of general graphs; the exact strong isometric dimension for cycles and hypercubes; and the isometric dimension for trees is found to within a factor of two.
متن کاملIsometric embeddings of Johnson graphs in Grassmann graphs
Let V be an n-dimensional vector space (4 ≤ n < ∞) and let Gk(V ) be the Grassmannian formed by all k-dimensional subspaces of V . The corresponding Grassmann graph will be denoted by Γk(V ). We describe all isometric embeddings of Johnson graphs J (l,m), 1 < m < l − 1 in Γk(V ), 1 < k < n − 1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J (n, k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 2008